A choice of bilevel linear programming solving parameters: factoraggregation approach
نویسندگان
چکیده
Our paper deals with the problem of choosing correct parameters for the bilevel linear programming solving algorithm proposed by M. Sakawa and I. Nishizaki. We suggest an approach based on factoraggregation, which is a specially designed general aggregation operator. The idea of factoraggregation arises from factorization by the equivalence relation generated by the upper level objective function. We prove several important properties of the factoraggregation result regarding the analysis of parameters in order to find an optimal solution for the problem. We illustrate the proposed method with some numerical and graphical examples, in particular we consider a modification of the mixed production planning problem.
منابع مشابه
A New Approach for Solving Fully Fuzzy Bilevel Linear Programming Problems
This paper addresses a type of fully fuzzy bilevel linear programming (FFBLP) wherein all the coefficients and decision variables in both the objective function and constraints are triangular fuzzy numbers. This paper proposes a new simple-structured, efficient method for FFBLP problems based on crisp bilevel programming that yields fuzzy optimal solutions with unconstraint variables and parame...
متن کاملA New Method For Solving Linear Bilevel Multi-Objective Multi-Follower Programming Problem
Linear bilevel programming is a decision making problem with a two-level decentralized organization. The leader is in the upper level and the follower, in the lower level. This study addresses linear bilevel multi-objective multi-follower programming (LB-MOMFP) problem, a special case of linear bilevel programming problems with one leader and multiple followers where each decision maker has sev...
متن کاملA new method for solving fully fuzzy linear Bilevel programming problems
In this paper, a new method is proposed to find the fuzzy optimal solution of fully fuzzy linear Bilevel programming (FFLBLP) problems by representing all the parameters as triangular fuzzy numbers. In the proposed method, the given FFLBLP problem is decomposed into three crisp linear programming (CLP) problems with bounded variables constraints, the three CLP problems are solved separately...
متن کاملSimulated Annealing Approach for Solving Bilevel Programming Problem
Bilevel programming, a tool for modeling decentralized decision problems, consists of the objective of the leader at its first level and that of the follower at the second level. Bilevel programming has been proved to be an Np-hard problem. Numerous algorithms have been developed for solving bilevel programming problems. These algorithms lack the required efficiency for solving a real problem. ...
متن کاملA New Method for Solving the Fully Interval Bilevel Linear Programming Problem with Equal Constraints
Most research on bilevel linear programming problem is focused on its deterministic form, in which the coefficients and decision variables in the objective functions and constraints are assumed to be crisp. In fact, due to inaccurate information, it is difficult to know exactly values of coefficients that used to construct a bilevel model. The interval set theory is suitable for describing and...
متن کامل